class Solution {    public int climbStairs(int n) {        if (n == 1) {            return 1;        }        int[] dp = new int[n + 1];        dp[1] = 1;        dp[2] = 2;        for (int i = 3; i <= n; i++) {            dp[i] = dp[i - 1] + dp[i - 2];        }        return dp[n];    }    public static void main(String[] args) {        Solution solution = new Solution();        int n = 7;        System.out.println(solution.climbStairs(n));        for (int i = 1; i <= n; i++) {            System.out.println(solution.climbStairs(i));        }    }}